An Efficient Radio Map Updating Algorithm based on K-Means and Gaussian Process Regression
نویسندگان
چکیده
منابع مشابه
Efficient Gaussian Process Based on Bfgs Updating and Logdet Approximation
Gaussian process (GP) is a Bayesian nonparametric regression model, showing good performance in various applications. However, its hyperparameterestimation procedure suffers from numerous covariance-matrix inversions of prohibitively O(N) operations. In this paper, we propose using the quasi-Newton BFGS O(N)-operation formula to update recursively the inverse of covariance matrix at every itera...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملAn Efficient Global K-means Clustering Algorithm
K-means clustering is a popular clustering algorithm based on the partition of data. However, K-means clustering algorithm suffers from some shortcomings, such as its requiring a user to give out the number of clusters at first, and its sensitiveness to initial conditions, and its being easily trapped into a local solution et cetera. The global Kmeans algorithm proposed by Likas et al is an inc...
متن کاملAn Efficient K-Means Clustering Algorithm
In this paper, we present a novel algorithm for performing k-means clustering. It organizes all the patterns in a k-d tree structure such that one can find all the patterns which are closest to a given prototype efficiently. The main intuition behind our approach is as follows. All the prototypes are potential candidates for the closest prototype at the root level. However, for the children of ...
متن کاملpersistent k-means: stable data clustering algorithm based on k-means algorithm
identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Navigation
سال: 2018
ISSN: 0373-4633,1469-7785
DOI: 10.1017/s037346331800019x